Set Mappings on 4-Tuples
نویسندگان
چکیده
منابع مشابه
On the Structure of Set-mappings
1 . Introduction. Let S be a set and f(x) a function which makes correspond to every x E S a subset fix) of S so that x(f (x) . Such a function f(x) we shall call a set-mapping defined on S. A subset S' 9 S is called free (or independent) with respect to the set-mapping f (x), if for every x E S' and Y E S', x ~f(y) and y ~ ftx) . Let S = m o and n < m. Assume that f(x) < n for every x E S. RUZ...
متن کاملReinforcement Learning with N-tuples on the Game Connect-4
Learning complex game functions is still a difficult task. We apply temporal difference learning (TDL), a well-known variant of the reinforcement learning approach, in combination with n-tuple networks to the game Connect-4. Our agent is trained just by self-play. It is able, for the first time, to consistently beat the optimal-playing Minimax agent (in game situations where a win is possible)....
متن کاملOrbits on n-tuples
A transitive (infinite) permutation group which has m orbits on ordered pairs of distinct points has at least mn−1 orbits on ordered n-tuples. This is best possible, and groups attaining the bound can be characterised.
متن کاملStationary Points for Set-valued Mappings on Two Metric Spaces
We give stationary point theorems of set-valued mappings in complete and compact metric spaces. The results in this note generalize a few results due to Fisher. 2000 Mathematics Subject Classification. 54H25.
متن کاملOn stationary points of nonexpansive set-valued mappings
*Correspondence: [email protected] 1Dpto. de Análisis Matemático, IMUS (Instituto Matemático de la Universidad de Sevilla), Universidad de Sevilla, C/Tarfia s/n, 41012 Sevilla, Spain Full list of author information is available at the end of the article Abstract In this paper we deal with stationary points (also known as endpoints) of nonexpansive set-valued mappings and show that the existence of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2018
ISSN: 0029-4527
DOI: 10.1215/00294527-2018-0002